منابع مشابه
DOMINATION NUMBER OF TOTAL GRAPH OF MODULE
Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملsome lower bounds for the $l$-intersection number of graphs
for a set of non-negative integers~$l$, the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$. the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملdomination number of total graph of module
let $r$ be a commutative ring and $m$ be an $r$-module with $t(m)$ as subset, the set of torsion elements. the total graph of the module denoted by $t(gamma(m))$, is the (undirected) graph with all elements of $m$ as vertices, and for distinct elements $n,m in m$, the vertices $n$ and $m$ are adjacent if and only if $n+m in t(m)$. in this paper we study the domination number of $t(ga...
متن کاملOn the Linear Intersection Number of Graphs
The celebrated Erdös, Faber and Lovász Conjecture may be stated as follows: Any linear hypergraph on v points has chromatic index at most v. We will introduce the linear intersection number of a graph, and use this number to give an alternative formulation of the Erdös, Faber, Lovász conjecture. Finally, first results about the linear intersection number will be proved. For example, the definit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Polonici Mathematici
سال: 1986
ISSN: 0066-2216,1730-6272
DOI: 10.4064/ap-47-2-155-178